Minimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh
نویسندگان
چکیده
Filling holes of 3D models is an important and complicated process. In this paper, we introduce a new and robust method for filling complex holes in triangular mesh models. In order to fill separate holes, the boundary edges of a hole are smoothly arranged and then locally uniform new points are added to the hole. The new points are selected by minimizing a hole filling area. The Delaunay triangulation method in a local area is applied for creating new meshes. By considering vertices of islands in a hole, new points can be added to the hole, which allows filling of a complex hole with islands.
منابع مشابه
A piecewise hole filling algorithm in reverse engineering
While scanning a complex part in reverse engineering, it is not possible to acquire all part of the scanned surface. Data are inevitably missing due to the complexity of the scanned part or imperfect scanning process. Missing scanned data cause holes in the created triangular mesh, so that a hole-free mesh model is prerequisite for fitting watertight surfaces. Although a number of hole filling ...
متن کامل3D reconstruction of cultural heritages: Challenges and advances on precise mesh integration
Several methods perform the integration of multiple range scans of an object aiming the generation of a reconstructed triangle mesh; however, achieving high fidelity digital reconstructions is still a challenge. That is mostly due to the existence of outliers in the acquired range data, and their harmful effects on the integration algorithms. In this work, we first discuss artifacts usually fou...
متن کاملFilling Holes in Triangular Meshes in Engineering
In this paper, a novel hole-filling algorithm for triangular meshes is proposed. Firstly, the hole is triangulated into a set of new triangles using modified principle of minimum angle. Then the initial patching mesh is refined according to the density of vertices on boundary edges. Finally, the patching mesh is optimized via the bilateral filter to recover missed features. Experimental results...
متن کاملUser-guided feature Sensitive Hole Filling for 3D Meshes
Most hole filling approaches use techniques to fill up a hole first and then to smooth it. Very few tries rebuild features on the filled surface of the original 3D model. We propose an efficient hole-filling methodology which preserves sharp features of the geometry of the original model. The main idea is that we reconstruct feature curves in the missing parts of the given mesh before filling t...
متن کاملOn the Way to Water-tight Mesh
This paper presents a new approach to generate water-tight surface mesh. In comparison with the two famous water-tight mesh generation algorithms: Tight Cocone (Dey and Goswami, 2003) and Power Crust (Amenta, Choi and Kolluri, 2001), our method shows a significant quality on the resulted models due to the efficient preand postprocessing. We choose our previously published online mesh generation...
متن کامل